On some problems related to palindrome closure

JOURNAL ARTICLE published October 2008 in RAIRO - Theoretical Informatics and Applications

Authors: Michelangelo Bucci | Aldo de Luca | Alessandro De Luca | Luca Q. Zamboni

Upper bound for palindromic and factor complexity of rich words

JOURNAL ARTICLE published 2021 in RAIRO - Theoretical Informatics and Applications

Authors: Josef Rukavicka

Palindromic complexity of infinite words associated with non-simple Parry numbers

JOURNAL ARTICLE published January 2009 in RAIRO - Theoretical Informatics and Applications

Authors: L'ubomíra Balková | Zuzana Masáková

Episturmian words: a survey

JOURNAL ARTICLE published July 2009 in RAIRO - Theoretical Informatics and Applications

Authors: Amy Glen | Jacques Justin

Directive words of episturmian words: equivalences and normalization

JOURNAL ARTICLE published April 2009 in RAIRO - Theoretical Informatics and Applications

Authors: Amy Glen | Florence Levé | Gwénaël Richomme

Drunken man infinite words complexity

JOURNAL ARTICLE published July 2008 in RAIRO - Theoretical Informatics and Applications

Authors: Marion Le Gonidec

On the distribution of characteristic parameters of words

JOURNAL ARTICLE published January 2002 in RAIRO - Theoretical Informatics and Applications

Authors: Arturo Carpi | Aldo de Luca

On the distribution of characteristic parameters of words II

JOURNAL ARTICLE published January 2002 in RAIRO - Theoretical Informatics and Applications

Authors: Arturo Carpi | Aldo de Luca

A combinatorial theorem on $p$-power-free words and an application to semigroups

JOURNAL ARTICLE published 1990 in RAIRO - Theoretical Informatics and Applications

Authors: Aldo de Luca | Stefano Varricchio